Minimum-Dilation Tour (and Path) is NP-hard
نویسندگان
چکیده
We prove that computing a minimum-dilation (Euclidean) Hamilton circuit or path on a given set of points in the plane is NP-hard.
منابع مشابه
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. We also show that the problem remains NP-hard even when a minimum-dilation tour or path is sought; not even an FPTAS exists in this case.
متن کاملar X iv : c s . C G / 0 70 30 23 v 1 6 M ar 2 00 7 Computing a Minimum - Dilation Spanning Tree is NP - hard ∗
In a geometric network G = (S,E), the graph distance between two vertices u, v ∈ S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices differs from their Euclidean distance. We show that given a set S of n points with integer coordinates in the plane and a rational dilation δ > 1, it is NP-hard to d...
متن کاملOn the approximability of covering points by lines and related problems
Given a set P of n points in the plane, Covering Points by Lines is the problem of finding a minimum-cardinality set L of lines such that every point p ∈ P is incident to some line l ∈ L. As a geometric variant of Set Cover, Covering Points by Lines is still NP-hard. Moreover, it has been proved to be APX-hard, and hence does not admit any polynomial-time approximation scheme unless P = NP. In ...
متن کاملSingle-Source Dilation-Bounded Minimum Spanning Trees
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r ∈ S is a designated source. Given a dilation factor δ, we ask for a geometric network G such that for every point v ∈ S there is a path from r to v in G of length at most δ|rv|, and such that the total edge length is minimized...
متن کاملThe Minimum Latency Problem Is NP-Hard for Weighted Trees
In the minimum latency problem (MLP) we are given n points v1, . . . , vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance from v1 to vi in the tour. The minimum latency problem is MAX-SNP-hard for general metric spaces, but t...
متن کامل